Mass-transshipment problems and ideal metrics
نویسندگان
چکیده
منابع مشابه
Solving Fully Interval Transshipment Problems
A new method namely, splitting method is proposed for finding an optimal solution to a transshipment problem in which all parameters are real intervals. With the help of a numerical example, the proposed method is illustrated. The splitting method is extended to fully fuzzy transshipment problems. Mathematical Subject Classification: 03E72
متن کاملOn Ideal Clutters, Metrics and Multiflows
Abs t rac t . "Binary clutters" contain various objects studied in Combinatorial Optimization, such as paths, Chinese Postman Tours, multiflows and one-sided circuits on surfaces. Minimax theorems about these can be generalized in terms of ideal binary clutters. Seymour has conjectured a characterization of these, and the goal of the present work is to study this conjecture in terms of multiflo...
متن کاملTransshipment Problems in Supply ChainSystems: Review and Extensions
Effective supply chain management (SCM) is currently recognized as a key determinant of competitiveness and success for most manufacturing and retailing organizations, because the implementation of supply chain management has significant impact on cost, service level, and quality. Numerous strategies for archiving these targets have been proposed and investigated in both practice and academic o...
متن کاملAn Inapproximability of Transshipment Problems with Permutable Transit Vectors
We investigate the hardness of approximating a transshipment problem with a permutable transit vector. We have already known that the transshipment problem of minimizing the total shipping cost is NP-hard. In this paper, we prove that even if the unit shipping cost associated with every arc is given as a positive integer, there is no polynomial time constant factor approximation algorithm for t...
متن کاملTools for Real-life Vehicle Routing Problems with Transshipment Par
véhicules aient la possibilité d'effectuer plusieurs arrêts sur leur route, nous proposons une heuristique d'agrégation des sites. Cela a également l'avan-tage de réduire davantage la taille du problème. Ce modèle étant résolu, nous lançons une exécution d'ILOG TPO avec les chemins d'ordres de transport figés, puis à partir de la solution finale de cette exécution, nous relançons ILOG TPO sans ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1994
ISSN: 0377-0427
DOI: 10.1016/0377-0427(94)90387-5